First-Order Logic on Higher-Order Nested Pushdown Trees
نویسندگان
چکیده
منابع مشابه
A First-Order Logic on Higher-Order Nested Pushdown Trees
We introduce a new hierarchy of higher-order nested pushdown trees generalising Alur et al.’s concept of nested pushdown trees. Nested pushdown trees are useful representations of control flows in the verification of programs with recursive calls of first-order functions. Higher-order nested pushdown trees are expansions of unfoldings of graphs generated by higher-order pushdown systems. Moreov...
متن کاملHigher-Order Pushdown Trees Are Easy
We show that the monadic second-order theory of an infinite tree recognized by a higher-order pushdown automaton of any level is decidable. We also show that trees recognized by pushdown automata of level n coincide with trees generated by safe higher-order grammars of level n. Our decidability result extends the result of Courcelle on algebraic (pushdown of level 1) trees and our own result on...
متن کاملFirst-Order Model Checking on Nested Pushdown Trees is Complete for Doubly Exponential Alternating Time
Recently, we showed that first-order model checking on nested pushdown trees can be done in doubly exponential alternating time with linear many alternations. Using the interpretation method of Compton and Henson we give a matching lower bound.
متن کاملNested Words for Order-2 Pushdown Systems
We study linear time model checking of collapsible higher-order pushdown systems (CPDS) of order 2 (manipulating stack of stacks) against MSO and PDL (propositional dynamic logic with converse and loop) enhanced with push/pop matching relations. To capture these linear time behaviours with matchings, we propose order-2 nested words. These graphs consist of a word structure augmented with two bi...
متن کاملFirst-Order Proof Tactics in Higher-Order Logic Theorem Provers
In this paper we evaluate the effectiveness of first-order proof procedures when used as tactics for proving subgoals in a higher-order logic interactive theorem prover. We first motivate why such first-order proof tactics are useful, and then describe the core integrating technology: an ‘LCFstyle’ logical kernel for clausal first-order logic. This allows the choice of different logical mapping...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Computational Logic
سال: 2013
ISSN: 1529-3785,1557-945X
DOI: 10.1145/2480759.2480760